Disjointly representing set systems
نویسندگان
چکیده
منابع مشابه
Representing embeddability as set inclusion
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graphs end-structure. Using a combinatorial theorem of Shelah it is proved: The complexity of the class in every regular uncountable A > Mi is at least A+ + sup{/x : jx+ < A} For all regular uncountable A > Mi there...
متن کاملFilling boxes densely and disjointly
We effectively construct in the Hilbert cube H = [0, 1]ω two sets V, W ⊂ H with the following properties: (a) V ∩ W = ∅, (b) V ∪ W is discrete-dense, i.e. dense in [0, 1]D ω , where [0, 1]D denotes the unit interval equipped with the discrete topology, (c) V , W are open in H. In fact, V = S N Vi, W = S N Wi, where Vi = S2i−1−1 0 Vij , Wi = S2i−1−1 0 Wij . Vij , Wij are basic open sets and (0, ...
متن کاملComplete Topoi Representing Models of Set Theory
Blass, A. and A. Scedrov, Complete topoi representing models of set theory, Annals of Pure and Applied Logic 57 (1992) l-26. By a model of set theory we mean a Boolean-valued model of Zermelo-Fraenkel set theory allowing atoms (ZFA), which contains a copy of the ordinary universe of (two-valued, pure) sets as a transitive subclass; examples include Scott-Solovay Boolean-valued models and their ...
متن کاملRepresenting Argumentation Frameworks in Answer Set Programming
This paper studies representation of argumentation frameworks (AFs) in answer set programming (ASP). Four different transformations from AFs to logic programs are provided under the complete semantics, stable semantics, grounded semantics and preferred semantics. The proposed transformations encode labelling-based argumentation semantics at the object level, and different semantics of AFs are u...
متن کاملOn the Capacity of Disjointly Shared Networks
Multi-access broadcast channels (such as ETHERNET or Fasnet [5], [6]) have the feature that a message is broadcast to all users, so that only one user can transmit on the channel at a time. The utilization of such a channel would be increased if it were possible for more than one user to occupy the channel at the same time. We consider the performance of a hypothetical channel having the proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2003
ISSN: 0097-3165
DOI: 10.1016/s0097-3165(03)00003-7